0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : app
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-ho \
0.00/0.01	  --no-avatar \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2 \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n187.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:05:23 CST 2018
0.00/0.21	% done 3 iterations in 0.003s
0.00/0.21	% SZS status Theorem for 'stdin'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(zf_stmt_7, conjecture,
0.00/0.21	  (cIRREFLEXIVE_LAW =>
0.00/0.21	   (![Xx:r]:
0.00/0.21	      (~
0.00/0.21	        (app_encode_app(r,$o,app_encode_app(r,app_encode_fun(r,$o),less,Xx),
0.00/0.21	                        c0) & 
0.00/0.21	         (Xx = c0)))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (cIRREFLEXIVE_LAW =>
0.00/0.21	     (![Xx:r]:
0.00/0.21	        (~
0.00/0.21	          (app_encode_app(r,$o,
0.00/0.21	                          app_encode_app(r,app_encode_fun(r,$o),less,Xx),c0) & 
0.00/0.21	           (Xx = c0))))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    app_encode_app(r, $o, 
0.00/0.21	      app_encode_app(r, app_encode_fun(r, $o), less, sk_Xx1), c0),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('1', plain, sk_Xx1 = c0, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain,
0.00/0.21	    app_encode_app(r, $o, 
0.00/0.21	      app_encode_app(r, app_encode_fun(r, $o), less, c0), c0),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff(zf_stmt_6, axiom,
0.00/0.21	  (cIRREFLEXIVE_LAW <=>
0.00/0.21	   (![Xx:r]:
0.00/0.21	      (~
0.00/0.21	        app_encode_app(r,$o,app_encode_app(r,app_encode_fun(r,$o),less,Xx),Xx))))).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X0 : r]:
0.00/0.21	      (~ app_encode_app(r, $o, 
0.00/0.21	           app_encode_app(r, app_encode_fun(r, $o), less, X0), X0)
0.00/0.21	       | ~ cIRREFLEXIVE_LAW),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_6])).
0.00/0.21	tff('4', plain, cIRREFLEXIVE_LAW,
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('5', plain,
0.00/0.21	    ![X0 : r]:
0.00/0.21	      (~ app_encode_app(r, $o, 
0.00/0.21	           app_encode_app(r, app_encode_fun(r, $o), less, X0), X0)
0.00/0.21	       | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['3', '4'])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X0 : r]:
0.00/0.21	      ~ app_encode_app(r, $o, 
0.00/0.21	          app_encode_app(r, app_encode_fun(r, $o), less, X0), X0),
0.00/0.21	    inference('simplify', [status(thm)], ['5'])).
0.00/0.21	tff('7', plain, ~ $true, inference('sup-', [status(thm)], ['2', '6'])).
0.00/0.21	tff('8', plain, $false, inference('simplify', [status(thm)], ['7'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
